Deep Triplet Supervised Hashing

نویسندگان

  • Xiaofang Wang
  • Abhinav Gupta
  • Xinlei Chen
  • Wei-Chiu Ma
  • Chenyang Li
  • Yi Shi
  • Anqi Li
چکیده

Hashing is one of the most popular and powerful approximate nearest neighbor search techniques for large-scale image retrieval. Most traditional hashing methods first represent images as off-the-shelf visual features and then produce hash codes in a separate stage. However, off-the-shelf visual features may not be optimally compatible with the hash code learning procedure, which may result in sub-optimal hash codes. Recently, deep hashing methods have been proposed to simultaneously learn image features and hash codes using deep neural networks and have shown superior performance over traditional hashing methods. The current state-of-the-art deep hashing method DPSH [14] has demonstrated great performance but it suffers the problem of unbalanced supervision signals. To address this issue, we propose two novel deep hashing methods DPSH-Weighted and DTSH. At the heart of our methods DPSH-Weighted and DTSH is the novel formulation of weighted pairwise label likelihood and triplet label likelihood. Our methods learn images features and hash codes by maximizing the label likelihood. One common problem that most deep hashing methods face is how to train a network to output binary codes. We provide in-depth analysis of two typical methods to train such a network. Extensive experiments on four public benchmark datasets, including CIFAR-10 [10], NUSWIDE [3], Standford Cars [9] and UKBench [23], show that both DPSH-Weighted and DTSH outperform the state-of-the-art method DPSH [14], and DTSH can obtain the highest performance among all the current deep hashing methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep Supervised Hashing with Triplet Labels

Hashing is one of the most popular and powerful approximate nearest neighbor search techniques for large-scale image retrieval. Most traditional hashing methods first represent images as off-the-shelf visual features and then produce hashing codes in a separate stage. However, off-the-shelf visual features may not be optimally compatible with the hash code learning procedure, which may result i...

متن کامل

Deep Class-Wise Hashing: Semantics-Preserving Hashing via Class-wise Loss

Deep supervised hashing has emerged as an influential solution to large-scale semantic image retrieval problems in computer vision. In the light of recent progress, convolutional neural network based hashing methods typically seek pair-wise or triplet labels to conduct the similarity preserving learning. However, complex semantic concepts of visual contents are hard to capture by similar/dissim...

متن کامل

Feature Learning Based Deep Supervised Hashing with Pairwise Labels

Recent years have witnessed wide application of hashing for large-scale image retrieval. However, most existing hashing methods are based on hand-crafted features which might not be optimally compatible with the hashing procedure. Recently, deep hashing methods have been proposed to perform simultaneous feature learning and hashcode learning with deep neural networks, which have shown better pe...

متن کامل

Deep Semantic-Preserving and Ranking-Based Hashing for Image Retrieval

Hashing techniques have been intensively investigated for large scale vision applications. Recent research has shown that leveraging supervised information can lead to high quality hashing. However, most existing supervised hashing methods only construct similarity-preserving hash codes. Observing that semantic structures carry complementary information, we propose the idea of cotraining for ha...

متن کامل

Deep Discrete Supervised Hashing

Hashing has been widely used for large-scale search due to its low storage cost and fast query speed. By using supervised information, supervised hashing can significantly outperform unsupervised hashing. Recently, discrete supervised hashing and deep hashing are two representative progresses in supervised hashing. On one hand, hashing is essentially a discrete optimization problem. Hence, util...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017